int c[100], temp[100];

void merge(int left, int right)
{
	if(left == right)return ;
	int mid = (left + right) / 2;

	merge(left, mid);
	merge(mid+1, right);

	for (int i = left; i <= right; i++) 
		temp[i] = c[i];

	int i1 = left, i2 = mid+1;
	for (int curr = left; curr <= right; curr++) // Merge
		if(i1 == mid+1)
			c[curr] = temp[i2++];
		else if(i2 == rigt+1)
			c[curr] = temp[i1++];
		else if(temp[i1] > temp[i2])
			c[curr] = temp[i1++];
		else
			c[curr] = temp[i2++];

	return ;
}
